Resource-Constrained Workflow Nets

We study concurrent processes modelled as workflow Petri nets extended with resource constrains. We define structural criteria for the correctness of such models based on traps and siphons. We also define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is used. We prove some properties of sound nets.